Modi!ed logarithmic Sobolev inequalities for some models of random walk!
نویسنده
چکیده
Logarithmic Sobolev inequalities are a well-studied technique for estimating rates of convergence of Markov chains to their stationary distributions. In contrast to continuous state spaces, discrete settings admit several distinct log Sobolev inequalities, one of which is the subject of this paper. Here we derive modi!ed log Sobolev inequalities for some models of random walk, including the random transposition shu"e and the top-random transposition shu"e on Sn, and the walk generated by 3-cycles on An. As an application, we derive concentration inequalities for these models. c © 2004 Elsevier B.V. All rights reserved.
منابع مشابه
Poincar e ’ s inequalities and Talagrand ’ s concentration phenomenon for the exponential distribution
We present a simple proof, based on modi ed logarithmic Sobolev inequalities, of Talagrand’s concentration inequality for the exponential distribution. We actually observe that every measure satisfying a Poincar e inequality shares the same concentration phenomenon. We also discuss exponential integrability under Poincar e inequalities and its consequence to sharp diameter upper bounds on spect...
متن کاملLogarithmic Sobolev techniques for random walks on graphs
Recently, Diaconis and Sarloff-Coste used logarithmic Sobolev inequalities to improve convergence bounds for random walks on graphs. We will give a strengthened version by showing that the random walk on a graph G on n vertices reach the stationarity (under total variation distance) after about 1 4α log log n steps where α denotes the log-Sobolev constant. Under the relative pointwise distance ...
متن کاملLogarithmic Sobolev, Isoperimetry and Transport Inequalities on Graphs
In this paper, we study some functional inequalities (such as Poincaré inequality, logarithmic Sobolev inequality, generalized Cheeger isoperimetric inequality, transportation-information inequality and transportation-entropy inequality) for reversible nearest-neighbor Markov processes on connected finite graphs by means of (random) path method. We provide estimates of the involved constants.
متن کاملLog-sobolev, Isoperimetry and Transport Inequalities on Graphs
In this paper, we study some functional inequalities (such as Poincaré inequalities, logarithmic Sobolev inequalities, generalized Cheeger isoperimetric inequalities, transportation-information inequalities and transportation-entropy inequalities) for reversible nearest-neighbor Markov processes on a connected finite graph by means of (random) path method. We provide estimates of the involved c...
متن کاملLogarithmic Harnack inequalities∗
Logarithmic Sobolev inequalities first arose in the analysis of elliptic differential operators in infinite dimensions. Many developments and applications can be found in several survey papers [1, 9, 12]. Recently, Diaconis and Saloff-Coste [8] considered logarithmic Sobolev inequalities for Markov chains. The lower bounds for log-Sobolev constants can be used to improve convergence bounds for ...
متن کامل